By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 22, Issue 3, pp. 431-659

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components

Ming-Yang Kao

pp. 431-459

BibTeX  Abstract Full Text:  PDF

Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees

Ming-Yang Kao and Gregory E. Shannon

pp. 460-481

BibTeX  Abstract Full Text:  PDF

Blocking Small Cuts in a Network, and Related Problems

Daniel Bienstock and Nicole Diaz

pp. 482-499

BibTeX  Abstract Full Text:  PDF

Floor-Planning by Graph Dualization: $2$-Concave Rectilinear Modules

Kok-Hoo Yeap and Majid Sarrafzadeh

pp. 500-526

BibTeX  Abstract Full Text:  PDF

A Quadratic Time Algorithm for the Minmax Length Triangulation

Herbert Edelsbrunner and Tiow Seng Tan

pp. 527-551

BibTeX  Abstract Full Text:  PDF

Inverting Polynomials and Formal Power Series

K. Kalorkoti

pp. 552-559

BibTeX  Abstract Full Text:  PDF

Nondeterminism within $P^ * $

Jonathan F. Buss and Judy Goldsmith

pp. 560-572

BibTeX  Abstract Full Text:  PDF

Parallel Complexity of the Connected Subgraph Problem

Lefteris M. Kirousis, Maria Serna, and Paul Spirakis

pp. 573-586

BibTeX  Abstract Full Text:  PDF

Finding Triconnected Components by Local Replacement

Donald Fussell, Vijaya Ramachandran, and Ramakrishna Thurimella

pp. 587-616

BibTeX  Abstract Full Text:  PDF

Improved Parallel Polynomial Division

Dario Bini and Victor Pan

pp. 617-626

BibTeX  Abstract Full Text:  PDF

The Complexity of Processing Hierarchical Specifications

Daniel J. Rosenkrantz and Harry B. Hunt, III

pp. 627-649

BibTeX  Abstract Full Text:  PDF

A Stochastic Checkpoint Optimization Problem

E. G. Coffman, Jr., Leopold Flatto, and Paul E. Wright

pp. 650-659

BibTeX  Abstract Full Text:  PDF